Irreducibility of generalized Hermite-Laguerre Polynomials III

For a positive integer $n$ and a real number $\alpha$, the generalized Laguerre polynomials are defined by \begin{align*} L^{(\alpha)}_n(x)=\sum^n_{j=0}\frac{(n+\alpha)(n-1+\alpha)\cdots (j+1+\alpha)(-x)^j}{j!(n-j)!}. \end{align*} These orthogonal polynomials are solutions to Laguerre's Differential Equation which arises in the treatment of the harmonic oscillator in quantum mechanics. Schur studied these Laguerre polynomials for its interesting algebraic properties. He obtained irreducibility results of $L^{(\pm \frac{1}{2})}_n(x)$ and $L^{(\pm \frac{1}{2})}_n(x^2)$ and derived that the Hermite polynomials $H_{2n}(x)$ and $\frac{H_{2n+1}(x)}{x}$ are irreducible for each $n$. In this article, we extend Schur's result by showing that the family of Laguerre polynomials $L^{(q)}_n(x)$ and $L^{(q)}_n(x^d)$ with $q\in \{\pm \frac{1}{3}, \pm \frac{2}{3}, \pm \frac{1}{4}, \pm \frac{3}{4}\}$, where $d$ is the denominator of $q$, are irreducible for every $n$ except when $q=\frac{1}{4}, n=2$ where we give the complete factorization. In fact, we derive it from a more general result.Comment: Published in Journal of Number Theor

Stolarsky's conjecture and the sum of digits of polynomial values

Let $s_q(n)$ denote the sum of the digits in the $q$-ary expansion of an integer $n$. In 1978, Stolarsky showed that $$\liminf_{n\to\infty} \frac{s_2(n^2)}{s_2(n)} = 0.$$ He conjectured that, as for $n^2$, this limit infimum should be 0 for higher powers of $n$. We prove and generalize this conjecture showing that for any polynomial $p(x)=a_h x^h+a_{h-1} x^{h-1} + ... + a_0 \in \Z[x]$ with $h\geq 2$ and $a_h>0$ and any base $q$, $$\liminf_{n\to\infty} \frac{s_q(p(n))}{s_q(n)}=0.$$ For any $\epsilon > 0$ we give a bound on the minimal $n$ such that the ratio $s_q(p(n))/s_q(n) < \epsilon$. Further, we give lower bounds for the number of $n < N$ such that $s_q(p(n))/s_q(n) < \epsilon$.Comment: 13 page

The sum of digits of nn and n2n^2

Let $s_q(n)$ denote the sum of the digits in the $q$-ary expansion of an integer $n$. In 2005, Melfi examined the structure of $n$ such that $s_2(n) = s_2(n^2)$. We extend this study to the more general case of generic $q$ and polynomials $p(n)$, and obtain, in particular, a refinement of Melfi's result. We also give a more detailed analysis of the special case $p(n) = n^2$, looking at the subsets of $n$ where $s_q(n) = s_q(n^2) = k$ for fixed $k$.Comment: 16 page

Perfect powers in products of terms of elliptic divisibility sequences

Diophantine problems involving recurrence sequences have a long history and is an actively studied topic within number theory. In this paper, we connect to the field by considering the equation \begin{align*} B_mB_{m+d}\dots B_{m+(k-1)d}=y^\ell \end{align*} in positive integers $m,d,k,y$ with $\gcd(m,d)=1$ and $k\geq 2$, where $\ell\geq 2$ is a fixed integer and $B=(B_n)_{n=1}^\infty$ is an elliptic divisibility sequence, an important class of non-linear recurrences. We prove that the above equation admits only finitely many solutions. In fact, we present an algorithm to find all possible solutions, provided that the set of $\ell$-th powers in $B$ is given. (Note that this set is known to be finite.) We illustrate our method by an example.Comment: To appear in Bulletin of Australian Math Societ

On members of Lucas sequences which are products of factorials

Here, we show that if $\{U_n\}_{n\ge 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=m_1!m_2!\cdots m_k!$ with $1<m_1\le m_2\le \cdots\le m_k$ satisfies $n<3\times 10^5$. We also give better bounds in case the roots of the Lucas sequence are real